Toward Transparent Selective Sequential Consistency in Distributed Shared Memory Systems

This paper proposes a transparent selective sequential consistency approach to Distributed Shared Memory (DSM) systems. First, three basic techniques | time selection, processor selection, and data selection { are analyzed for improving the performance of strictly sequential consistency DSM systems, and a transparent approach to achieving these selections is proposed. Then, this paper focuses on the protocols and techniques devised to achieve transparent data selection, including a novel Selective Lazy/Eager Updates Propagation protocol for propagating updates on shared data objects, and the Critical Region Updated Pages Set scheme to automatically detect the associations between shared data objects and synchronization objects. The proposed approach is able to ooer the same potential performance advantages as the Entry Consistency model or the Scope Consistency model, but it imposes no extra burden to programmers and never fails to execute programs correctly. The devised protocols and techniques have been implemented and experimented with in the context of the TreadMarks DSM system. Performance results have shown that for many applications , our transparent data selection approach out-performs the Lazy Release Consistency model using a lazy or eager updates propagation protocol. Personal use of this material is permitted. However , permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works, must be obtained from the IEEE.